1167B - Lost Numbers - CodeForces Solution

#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
using namespace std;

void solve() {
    vector <int> p = { 4, 8, 15, 16, 23, 42 }, v(5);
    for (int i = 1; i <= 4; i++) {
        cout << "? " << i << ' ' << i + 1 << endl;
        cin >> v[i];
    }
    do {
        bool flag = true;
        for (int i = 0; i < 4; i++) {
            if (p[i] * p[i + 1] != v[i + 1]) flag = false;
        }
        if (flag) {
            cout << "! ";
            for (int i = 0; i < 6; i++) {
                cout << p[i] << ' ';
            }
            cout << endl;
            return;
        }
    } while (next_permutation(p.begin(), p.end()));
}

int main() {
    solve();
}